Compressed Suffix Trees with Full Functionality
نویسندگان
چکیده
منابع مشابه
Practical Compressed Suffix Trees
The suffix tree is an extremely important data structure in bioinformatics. Classical implementations require much space, which renders them useless to handle large sequence collections. Recent research has obtained various compressed representations for suffix trees, with widely different space-time tradeoffs. In this paper we show how the use of range min-max trees yields novel representation...
متن کاملA Fully-Compressed Suffix Trees
Suffix trees are by far the most important data structure in stringology, with a myriad of applications in fields like bioinformatics and information retrieval. Classical representations of suffix trees require Θ(n logn) bits of space, for a string of size n. This is considerably more than the n log2 σ bits needed for the string itself, where σ is the alphabet size. The size of suffix trees has...
متن کاملDynamic Fully-Compressed Suffix Trees
Suffix trees are by far the most important data structure in stringology, with myriads of applications in fields like bioinformatics, data compression and information retrieval. Classical representations of suffix trees require O(n log n) bits of space, for a string of size n. This is considerably more than the n log 2 σ bits needed for the string itself, where σ is the alphabet size. The size ...
متن کاملEngineering Fully-Compressed Suffix Trees
The suffix tree is a classical data structure that provides optimal solutions to countless string processing problems. For a text of length n, a pointerbased representation of a suffix tree requires Θ(n log n) bits, whereas compact representations use O(n) bits on top of the size of the compressed text. The fully-compressed suffix tree (FCST) provides the same functionality using o(n) bits on t...
متن کاملFaster entropy-bounded compressed suffix trees
Suffix trees are among the most important data structures in stringology, with a number of applications in flourishing areas like bioinformatics. Their main problem is space usage, which has triggered much research striving for compressed representations that are still functional. A smaller suffix tree representation could fit in a faster memory, outweighing by far the theoretical slowdown brou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2007
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-006-1198-x